Encoding monomorphic and polymorphic types

Most automatic theorem provers are restricted to untyped logics, and existing translations from typed logics are bulky or unsound. Recent research proposes monotonicity as a means to remove some clutter. Here we pursue this approach systematically, analysing formally a variety of encodings that further improve on efficiency while retaining soundness and completeness. We extend the approach to rank-1 polymorphism and present alternative schemes that lighten the translation of polymorphic symbols based on the novel notion of “cover”. The new encodings are implemented, and partly proved correct, in Isabelle/HOL. Our evaluation finds them vastly superior to previous schemes

Polytopic Cryptanalysis

Standard differential cryptanalysis uses statistical dependencies between the difference of two plaintexts and the difference of the respective two ciphertexts to attack a cipher. Here we introduce polytopic cryptanalysis which considers interdependencies between larger sets of texts as they traverse through the cipher. We prove that the methodology of standard differential cryptanalysis can unambiguously be extended and transferred to the polytopic case including impossible differentials. We show that impossible polytopic transitions have generic advantages over impossible differentials. To demonstrate the practical relevance of the generalization, we present new low-data attacks on round-reduced DES and AES using impossible polytopic transitions that are able to compete with existing attacks, partially outperforming these

Bisphenol A-glycidyl methacrylate induces a broad spectrum of DNA damage in human lymphocytes

Bisphenol A-glycidyl methacrylate (BisGMA) is monomer of dental filling composites, which can be released from these materials and cause adverse biologic effects in human cells. In the present work, we investigated genotoxic effect of BisGMA on human lymphocytes and human acute lymphoblastic leukemia cell line (CCRF-CEM) cells. Our results indicate that BisGMA is genotoxic for human lymphocytes. The compound induced DNA damage evaluated by the alkaline, neutral, and pH 12.1 version of the comet assay. This damage included oxidative modifications of the DNA bases, as checked by DNA repair enzymes EndoIII and Fpg, alkali-labile sites and DNA double-strand breaks. BisGMA induced DNA-strand breaks in the isolated plasmid. Lymphocytes incubated with BisGMA at 1 mM were able to remove about 50% of DNA damage during 120-min repair incubation. The monomer at 1 mM evoked a delay of the cell cycle in the S phase in CCRF-CEM cells. The experiment with spin trap—DMPO demonstrated that BisGMA induced reactive oxygen species, which were able to damage DNA. BisGMA is able to induce a broad spectrum of DNA damage including severe DNA double-strand breaks, which can be responsible for a delay of the cell cycle in the S phase

Legislative History: An Act Concerning the Operation of Emergency Medical Vehicles (SP482)(LD 1303)

https://digitalmaine.com/legishist114/2302/thumbnail.jp

Retour d'expérience sur les bassins d'orage en réseau unitaire: une solution pour limiter les rejets de temps de pluie

International audienceLe développement des systèmes d'assainissement s'appuie souvent sur des structures construites il y a plusieurs décennies. Ces systèmes font face à une augmentation des niveaux d'exigence qui leur sont assignés. Dans le viseur de l'arrêté de 2015 notamment, les performances par temps de pluie des systèmes de collecte. Un retour d'expériences sur les bassins d'orage mené par le Cerema fait le point sur les interrogations et les solutions trouvées par les gestionnaires. CONTEXTE DE L'ETUDE En collaboration avec l'AFB, le GEMCEA, le Ministère de la transition écologique et solidaire et les Agences de l'eau, le Cerema a réalisé un vaste retour d'expériences sur les bassins d'orage implantés sur les réseaux d'assainissement unitaires. L'objet de ce retour d'expériences était de voir, sur le terrain, comment les gestionnaires/exploitants avaient eu recours à cette technique pour optimiser le fonctionnement de leur système, notamment par temps de pluie, et de collecter des informations techniques et financières quant au fonctionnement, à la conception, au dimensionnement de ce type d'ouvrages. A travers une recherche bibliographique et de nombreux entretiens réalisés auprès de 17 maîtres d'ouvrage/exploitants, ce travail a aussi permis indirectement de recueillir les témoignages des personnes interrogées quant aux enjeux et aux problématiques auxquelles les services peuvent être confrontés, aux difficultés techniques rencontrées, souvent liées à leur contexte local, et à la façon dont les collectivités ont cherché à y remédier notamment par la construction de bassins d'orage. Le projet ayant débuté au 2nd semestre 2013 et s'étant terminé en 2018, nous avons ainsi pu être les témoins, un peu malgré nous, des interrogations des différents acteurs vis-à-vis des évolutions de la réglementation en matière d'assainissement : autosurveillance, diagnostic permanent, choix du critère de conformité du système de collecte, … ainsi que des conséquences des lois NOTRe 5 et MAPTAM 6 sur la répartition des compétences à court et moyen termes. Cette communication fait volontairement le choix de se focaliser sur les éléments recueillis qui concernent les enjeux et opportunités de l'autosurveillance et du diagnostic permanent, les démarches mises en place par les gestionnaires pour optimiser le fonctionnement de leur système et répondre aux nouveaux critères de conformité fixés par l'arrêté de 2015

Quantum Algorithms for the k-xor Problem

International audienceThe k-xor (or generalized birthday) problem is a widely studied question with many applications in cryptography. It aims at finding k elements of n bits, drawn at random, such that the xor of all of them is 0. The algorithms proposed by Wagner more than fifteen years ago remain the best known classical algorithms for solving them, when disregarding logarithmic factors. In this paper we study these problems in the quantum setting, when considering that the elements are created by querying a random function (or k random functions) H : {0, 1} n → {0, 1} n. We consider two scenarios: in one we are able to use a limited amount of quantum memory (i.e. a number O(n) of qubits, the same as the one needed by Grover's search algorithm), and in the other we consider that the algorithm can use an exponential amount of qubits. Our newly proposed algorithms are of general interest. In both settings, they provide the best known quantum time complexities. In particular, we are able to considerately improve the 3-xor algorithm: with limited qubits, we reach a complexity considerably better than what is currently possible for quantum collision search. Furthermore, when having access to exponential amounts of quantum memory, we can take this complexity below O(2 n/3), the well-known lower bound of quantum collision search, clearly improving the best known quantum time complexity also in this setting. We illustrate the importance of these results with some cryptographic applications